Queue Content Analysis in a 2-Class Discrete-Time Queueing System under the Slot-Bound Priority Service Rule

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Queue Content Analysis in a 2-Class Discrete-Time Queueing System under the Slot-Bound Priority Service Rule

The paper we present here introduces a new priority mechanism in discrete-time queueing systems. It is a milder form of priority when compared to HoL priority, but it favors customers of one type over the other when compared to regular FCFS. It also provides an answer to the starvation problem that occurs in HoL priority systems. In this new priority mechanism, customers of different priority c...

متن کامل

Delay analysis of a discrete-time multiclass slot-bound priority system

This paper introduces a new priority mechanism in discretetime queueing systems that compromises between first-come-first-served (FCFS) and head-of-line (HoL) priority. In this scheduling discipline which we dubbed slot-bound priority customers of different priority classes entering the system during the same time-slot are served in order of their respective priority class. Customers entering d...

متن کامل

Frame-bound Priority Scheduling in Discrete-time Queueing Systems

A well-known problem with priority policies is starvation of delaytolerant traffic. Additionally, insufficient control over delay differentiation (which is needed for modern network applications) has incited the development of sophisticated scheduling disciplines. The priority policy we present here has the benefit of being open to rigorous analysis. We study a discretetime queueing system with...

متن کامل

Time-dependent performance analysis of a discrete-time priority queue

We present the transient analysis of the system content in a two-class discrete-time M X /D/1 priority queue. In particular, we derive an expression for the generating function of the transient system contents of both classes at the beginning of slots. Performance measures are calculated from this generating function. To illustrate our approach we conclude with some examples. c © 2008 Elsevier ...

متن کامل

Analysis of a Discrete-Time Queue with Gated Priority

This paper considers a discrete-time queue with gated priority. Low priority customers arrive at the first queue at the gate in batches according to a batch Bernoulli process (BBP). When the gate opens, all low priority customers at the first queue move to the second queue at a single server. On the other hand, high priority customers directly join the second queue upon arrival. The arrival pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2012

ISSN: 1024-123X,1563-5147

DOI: 10.1155/2012/425630